F . Jacquemard , M . Rusinowitch and L . Vigneron Tree automata with equality constraints modulo equational theories Research Report LSV - 05 - 16 August 2005
نویسندگان
چکیده
This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata presentations with suitable paramodulation strategies terminates. We sketch an application of these tree automata classes, extended with memory, to the verification of reachability for the applied pi-calculus.
منابع مشابه
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalize...
متن کاملDecidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms whose positions are defined by the stat...
متن کاملUni cation in Extensions of Shallow Equational Theories
We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...
متن کاملUniication in Extensions of Shallow Equational Theories
We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...
متن کاملS . Demri and R . Gascon Verification of qualitative Z constraints Research Report LSV - 05 - 07 June 2005
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x < y, it is closed under Boolean operations and it admits a restricted form of existential quantification. This is the largest set of qualitative constraints over Z known so far, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005